Conclusive local interpretation rules for random forests
نویسندگان
چکیده
In critical situations involving discrimination, gender inequality, economic damage, and even the possibility of casualties, machine learning models must be able to provide clear interpretations their decisions. Otherwise, obscure decision-making processes can lead socioethical issues as they interfere with people’s lives. Random forest algorithms excel in aforementioned sectors, where ability explain themselves is an obvious requirement. this paper, we present LionForests, which relies on a preliminary work ours. LionForests random forest-specific interpretation technique that provides rules explanations. It applies binary classification tasks up multi-class regression tasks, while stable theoretical background supports it. A time scalability analysis suggests much faster than our also applicable large datasets. Experimentation, including comparison state-of-the-art techniques, demonstrate efficacy contribution. outperformed other techniques terms precision, variance, response time, but fell short rule length coverage. Finally, highlight conclusiveness, unique property validity distinguishes it from previous techniques.
منابع مشابه
Relational Random Forests Based on Random Relational Rules
Random Forests have been shown to perform very well in propositional learning. FORF is an upgrade of Random Forests for relational data. In this paper we investigate shortcomings of FORF and propose an alternative algorithm, RF, for generating Random Forests over relational data. RF employs randomly generated relational rules as fully self-contained Boolean tests inside each node in a tree and ...
متن کاملAsymptotic Theory for Random Forests
Random forests have proven to be reliable predictive algorithms in many application areas. Not much is known, however, about the statistical properties of random forests. Several authors have established conditions under which their predictions are consistent, but these results do not provide practical estimates of random forest errors. In this paper, we analyze a random forest model based on s...
متن کاملRandom Forests for Big Data
Big Data is one of the major challenges of statistical science and has numerous consequences from algorithmic and theoretical viewpoints. Big Data always involve massive data but they also often include data streams and data heterogeneity. Recently some statistical methods have been adapted to process Big Data, like linear regression models, clustering methods and bootstrapping schemes. Based o...
متن کاملRandom Forests for CUDA GPUs
Context. Machine Learning is a complex and resource consuming process that requires a lot of computing power. With the constant growth of information, the need for efficient algorithms with high performance is increasing. Today's commodity graphics cards are parallel multi processors with high computing capacity at an attractive price and are usually pre-installed in new PCs. The graphics cards...
متن کامل1 Random Forests - - Random Features
Random forests are a combination of tree predictors such that each tree depends on the values of a random vector sampled independently and with the same distribution for all trees in the forest. The generalization error for forests converges a.s. to a limit as the number of trees in the forest becomes large. The error of a forest of tree classifiers depends on the strength of the individual tre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data Mining and Knowledge Discovery
سال: 2022
ISSN: ['1573-756X', '1384-5810']
DOI: https://doi.org/10.1007/s10618-022-00839-y